Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
نویسندگان
چکیده
منابع مشابه
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
The inventory routing problem considered in this paper is concerned with the repeated distribution of a commodity, such as heating oil, over a long period of time to a large number of customers. The problem involves a central depot as well as various satellite facilities which the drivers can visit during their shift to refill their vehicles. The customers maintain a local inventory of the comm...
متن کاملApproximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems
We study a deterministic maritime inventory routing problem with a long planning horizon. For instances with many ports and many vessels, mixed-integer linear programming (MIP) solvers often require hours to produce good solutions even when the planning horizon is 90 or 120 periods. Building on the recent successes of approximate dynamic programming (ADP) for road-based applications within the ...
متن کاملDynamic Programming Approximations for a Stochastic Inventory Routing Problem
This work is motivated by the need to solve the inventory routing problem when implementing a business practice called vendor managed inventory replenishment (VMI). With VMI, vendors monitor their customers’ inventories, and decide when and how much inventory should be replenished at each customer. The inventory routing problem attempts to coordinate inventory replenishment and transportation i...
متن کاملA New Framework for Secure Routing in VANET
Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle’s speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET thr...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2002
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.36.3.292.7829